Polyomino tilings, cellular automata and codicity
نویسندگان
چکیده
منابع مشابه
Combinatorially Regular Polyomino Tilings
Let T be a regular tiling of R which has the origin 0 as a vertex, and suppose that φ : R → R is a homeomorphism such that i) φ(0) = 0, ii) the image under φ of each tile of T is a union of tiles of T , and iii) the images under φ of any two tiles of T are equivalent by an orientation-preserving isometry which takes vertices to vertices. It is proved here that there is a subset Λ of the vertice...
متن کاملGliders in Cellular Automata on Penrose Tilings
In this paper, we present the first glider capable of navigating an aperiodic tiling. It inhabits a four-state outer-totalistic cellular automaton, and operates on generic tilings of quadrilaterals. We investigate its behaviour on both the P2 (kite and dart) and P3 (rhombus) Penrose tilings, and characterise the different types of path it can follow. Further, we note that the path followed by t...
متن کاملSome Polyomino Tilings of the Plane
We calculate the generating functions for the number of tilings of rectangles of various widths by the right tromino, the L tetromino, and the T tetromino. This allows us to place lower bounds on the entropy of tilings of the plane by each of these. For the T tetromino, we also derive a lower bound from the solution of the Ising model in two dimensions.
متن کاملCellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A Survey
The first paper on cellular automata in the hyperbolic plane appeared in [37], based on the technical report [35]. Later, several papers appeared in order to explore this new branch of computer science. Although applications are not yet seen, they may appear, especially in physics, in the theory of relativity or for cosmological researches.
متن کاملTuring Patterns, Cellular Automata, Tilings and Op-Art
I provide a brief survey documenting the inclusion of cellular automata, periodic tilings and op-art in mathematical art. Then I give an overview of the history of Turing-like patterns in mathematical art. I describe a cellular automaton for producing Turing-like patterns and introduce some new variations. This leads to an open problem concerning the convergence of such patterns. Turing and Tur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00201-s